Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
نویسندگان
چکیده
Consider the holiday season, where there are n players who would like to exchange gifts. That is, we would like to generate a random permutation having no fixed point. It is known that such a random permutation can be obtained in a hidden form by using a number of physical cards of four colors with identical backs, guaranteeing that it has no fixed point (without revealing the permutation itself). This paper deals with such a problem and improves the known result: whereas the known protocol needs O(n) cards of four colors, our efficient protocol uses only O(n log n) cards of two colors.
منابع مشابه
An Analysis of a Simple Algorithm for Random Derangements
We consider the uniform generation of random derangements, i.e., permutations without any fixed point. By using a rejection algorithm, we improve the straight-forward method of generating a random permutation until a derangement is obtained. This and our procedure are both linear with respect to the number of calls to the random generator, but we obtain an improvement of more than 36%. By using...
متن کاملA stochastic model for the number of fixed points of a Welch Costas permutation
Exploiting the empirical observation that the probability of k fixed points in a Welch Costas permutation is approximately the same as in a random permutation of the same order, we propose a stochastic model for the most probable maximal number of fixed points in a Welch Costas permutation.
متن کاملLecture Notes Cryptographic Protocols
ii iii Preface In this course, we focus on asymmetric techniques for cryptographic protocols, also considering proofs of security for various constructions. Motivating example: 'Sinterklaaslootjes trekken' is a Dutch tradition for buying presents and writing little poems, see, The same tradition is also known as " Secret Santa " , and a lot of websites and programs are available to help people ...
متن کاملCard-based protocols using unequal division shuffles
Card-based cryptographic protocols can perform secure computation of Boolean functions. In 2013, Cheung et al. presented a protocol that securely produces a hidden AND value using five cards; however, it fails with a probability of 1/2. The protocol uses an unconventional shuffle operation called an unequal division shuffle; after a sequence of five cards is divided into a two-card portion and ...
متن کاملThe IUFP Algorithm for Generating Simulation Heart
In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...
متن کامل